Large Connectivity for Dynamic Random Geometric Graphs
نویسندگان
چکیده
منابع مشابه
Dynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملConnectivity of Random High Dimensional Geometric Graphs
We consider graphs obtained by placing n points at random on a unit sphere in R, and connecting two points by an edge if they are close to each other (e.g., the angle at the origin that their corresponding unit vectors make is at most π/3). We refer to these graphs as geometric graphs. We also consider a complement family of graphs in which two points are connected by an edge if they are far aw...
متن کاملRandom walk with jumps in large-scale random geometric graphs
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30...
متن کاملConnectivity of Random Geometric Graphs Related to Minimal Spanning Forests
The a.s. connectivity of the Euclidean minimal spanning forest MSF(X) on a homogeneous Poisson point process X ⊂ R is an open problem for dimension d > 2. We introduce a descending family of graphs (Gn)n≥2 that can be seen as approximations to the MSF in the sense that MSF(X) = ⋂∞ n=2Gn(X). For n = 2 one recovers the relative neighborhood graph or, in other words, the β-skeleton with β = 2. We ...
متن کاملPercolation and Connectivity in AB Random Geometric Graphs
Given two independent Poisson point processes Φ(1),Φ(2) in Rd, the AB Poisson Boolean model is the graph with points of Φ(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of Φ(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2009
ISSN: 1536-1233
DOI: 10.1109/tmc.2009.42